Reenement of Parameterized Algebraic Speciications Reenement of Parameterized Algebraic Speciications
نویسنده
چکیده
A reenement relation for parameterized algebraic speciications is introduced in which the body speciication is reened covariantly (i.e., specialized) while the parameter speciication is reened contravariantly (i.e., generalized). This reenement is similar to the subtyping relation between function types. Assuming a few relatively weak axioms about parameterized speciications, re-nement is shown to satisfy the expected properties for software development in-the-large: independent reenement of body and parameter, and closure under sequential composition, instantiation and a suitable form of`horizontal' composition.
منابع مشابه
The Architecture of SPECWARE
Specware is a tool that supports the modular construction of formal speciications and the stepwise and componentwise reenement of such speciications into executable code. Specware may be viewed as a visual interface to an abstract data type providing a suite of composition and transformation operators for building speciications, reenements, code modules, etc. This view has been realized in the ...
متن کاملSpeci cation and Data Re nement in Type
We develop a type-theoretic approach to program speciication and data reene-ment and show that a type theory with a strong logical power and nice structural mechanisms provides an adequate formalism for modular development of programs and speciications. Speciication of abstract data types is considered and a notion of abstract implementation between speciications is deened in the type theory an...
متن کاملState Re nement in Process
We introduce a state reenement operator into BPA with recursive speciications and present a comprehensive technical development of the resulting theory, BPA + SR. Our main technical results are that bisimulation is a congruence in BPA+SR and that guarded recursive speciications have unique solutions. We also have that bisimulation remains a congruence if the merge operator of ACP is added to BP...
متن کاملReenement versus Veriication: Compatibility of Net Invariants and Stepwise Development of High-level Petri Nets
The concept of rule-based modiication developed in the area of algebraic graph transformations and high-level replacement systems has recently shown to be a powerful concept for vertical stucturing of Petri nets. This includes low-level and high-level Petri nets, especially algebraic high-level nets which can be considered as an integration of algebraic speciications and Petri nets. In a large ...
متن کاملUsing the Reenement Calculus for Dataaow Processes Using the Reenement Calculus for Dataaow Processes
The reenement calculus, based on predicate transformer semantics, is proving useful in the construction of sequential programs. It is argued that the reenement calculus provides a suitable development formalism for (possibly real-time) dataaow-like processes. Conventional precondition and postcondition speciications of sequential programs are generalised to assumption and eeect speciications of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997